Routing Optimization with Time Windows under Uncertainty
نویسندگان
چکیده
Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print or online or to submit the papers to another publication.
منابع مشابه
A Green Competitive Vehicle Routing Problem under Uncertainty Solved by an Improved Differential Evolution Algorithm
Regarding the development of distribution systems in the recent decades, fuel consumption of trucks has increased noticeably, which has a huge impact on greenhouse gas emissions. For this reason, the reduction of fuel consumption has been one of the most important research areas in the last decades. The aim of this paper is to propose a robust mathematical model for a variant of a vehicle routi...
متن کاملThe Special Application of Vehicle Routing Problem with Uncertainty Travel Times: Locomotive Routing Problem
This paper aims to study the locomotive routing problem (LRP) which is one of the most important problems in railroad scheduling in view of involving expensive assets and high cost of operating locomotives. This problem is assigning a fleet of locomotives to a network of trains to provide sufficient power to pull them from their origins to destinations by satisfying a rich set of operational con...
متن کاملAn Improved Particle Swarm Optimization for a Class of Capacitated Vehicle Routing Problems
Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...
متن کاملA PFIH-Based Heuristic for Green Routing Problem with Hard Time Windows
Transportation sector generates a considerable part of each nation's gross domestic product and considered among the largest consumers of oil products in the world. This paper proposes a heuristic method for the vehicle routing problem with hard time windows while incorporating the costs of fuel, driver, and vehicle. The proposed heuristic uses a novel speed optimization algorithm to reach its ...
متن کاملA Model and Algorithm for the Courier Delivery Problem with Uncertainty
We consider the Courier Delivery Problem, a variant of the Vehicle Routing Problem with time windows in which customers appear probabilistically and their service times are uncertain. We use scenario-based stochastic programming with recourse to model the uncertainty in customers and robust optimization for the uncertainty in service times. Our proposed model generates a master plan and daily s...
متن کاملA Combined Stochastic Programming and Robust Optimization Approach for Location-Routing Problem and Solving it via Variable Neighborhood Search algorithm
The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...
متن کامل